Optimal Stopping on Patterns in Strings Generated
نویسنده
چکیده
منابع مشابه
Stopping on patterns in strings and applications to optimal search and selection problems
This talk presents an attempt to unify sequential search and selection problems in the light of optimal stopping problems on strings. The basic model is as follows: Strings are generated by sequences of letters or other codes produced by independent draws from a given alphabet or another source. The law of drawing different letters or expressions may be time-invariant (stationary) or else depen...
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کاملNew stopping criterion for genetic algorithms
Genetic Algorithms have been successfully applied in a wide variety of problems. Although widely used, there are few theoretical guidelines for determining when to terminate the search. One result by Aytug and Koehler provides a loose bound on the number of GA generations needed to see all populations (and hence, an optimal solution) with a specified probability. In this paper we derive a tight...
متن کاملOptimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem
In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...
متن کاملOptimal Stopping with Advanced Information Flow: Selected Examples
Abstract We study optimal stopping problems for some functionals of Brownian motion in the case when the decision whether or not to stop before (or at) time t is allowed to be based on the δ-advanced information Ft+δ, where Fs is the σ-algebra generated by Brownian motion up to time s, s ≥ −δ, δ > 0 being a fixed constant. Our approach involves the forward integral and the Malliavin calculus fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002